NEW PARAMETER REDUCTION OF SOFT SETS MA XIUQIN Thesis submitted in fulfilment of the requirements for the award of the degree of Doctor of Philosophy (Computer Science) Faculty of Computer Systems & Software Engineering UNIVERSITI MALAYSIA PAHANG

نویسنده

  • MA XIUQIN
چکیده

Several algorithms exist to address the issues concerning parameter reduction of soft sets. The most recent concept of Normal Parameter Reduction (NPR) is introduced, which overcomes the problem of suboptimal choice and added parameter set of soft sets. However, the algorithm involves a great amount of computation. In this thesis, a New Efficient Normal Parameter Reduction algorithm (NENPR) of soft sets is proposed based on the new theorems, which have been proved and presented. The proposed technique can be carried out without parameter important degree and decision partition. As a result, it can involve relatively less computation, compared with the algorithm of NPR. The experimental results are analyzed and comparisons are done with three real-life datasets and ten synthetic generated datasets. The computational complexity is described in terms of the number of entry access, the number of parameter importance degree access and oriented-parameter access, and the number of candidate parameter reduction set. From these experimental results, some conclusions can be drawn that NENPR improves the number of entry access, the number of parameter importance degree access and oriented-parameter access, the number of candidate parameter reduction set and the executing time of NPR averagely up to 95.21%, 52.45%, 53.58% and 60.02% through three real-life datasets and ten synthetic generated datasets, respectively. Sum up, NENPR provides the better solutions for capturing the normal parameter reduction compared with NPR. An interval-valued fuzzy soft set is a special case of a soft set by combining the interval-valued fuzzy set and soft set. However, up to the present, the previous work has not involved parameter reduction of the interval-valued fuzzy soft sets. In this thesis, four new parameter reductions of the interval-valued fuzzy soft sets are proposed: Optimal Choice Considered Parameter Reduction (OCCPR), Invariable Rank of Decision Choice Considered Parameter Reduction (IRDCCPR), Standard Parameter Reduction (SPR) and Approximate Standard Parameter Reduction (ASPR). The related heuristic algorithms are given. In order to show the high efficiency of the proposed four algorithms, comparisons and analysis for decision making between OCCPR, IRDCCPR, ASPR, SPR and directly Interval-Valued Fuzzy Soft Sets based Fuzzy Decision Making algorithm (IVFSS-FDM) with three real-life datasets and ten synthetic generated datasets are made. Average percent of improvement of four proposed algorithms compared with IVFSS-FDM on the executing time concerning all of datasets are 80.28%, 56.37%, 47.44%, 10%, respectively. From these experimental results, conclusions can be drawn that our four proposed algorithms have much higher efficiency compared with directly IVFSS-FDM for decision making and four approaches have the respective merits and demerits. Therefore these proposed methods can be applied into the different situations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Measuring the Performance of the Virtual Teams in Global Software Development Projects

The development teams who are geographically spread, culturally mixed and mainly depend on information and communication technology (ICT) for communication is defined as a global virtual teams (GVTs). Despite the advancement of technologies, achieving the efficient performance of GVTs remains a challenge. The reviewed literature has highlighted the importance of training and development, organi...

متن کامل

MGR: An information theory based hierarchical divisive clustering algorithm for categorical data

http://dx.doi.org/10.1016/j.knosys.2014.03.013 0950-7051/ 2014 Elsevier B.V. All rights reserved. ⇑ Corresponding author at: Faculty of Computer Systems & Software Engineering, Universiti Malaysia Pahang, Lebuhraya Tun Razak, Gambang, 26300 Kuantan, Malaysia. E-mail addresses: [email protected] (H. Qin), [email protected] (X. Ma), [email protected] (T. Herawan), [email protected] (J.M. Zain). Hongw...

متن کامل

Fast Cellular Automata Implementation on Graphic Processor Unit (GPU) for Salt and Pepper Noise Removal

Noise removal operation is commonly applied as pre-processing step before subsequent image processing tasks due to the occurrence of noise during acquisition or transmission process. A common problem in imaging systems by using CMOS or CCD sensors is appearance of  the salt and pepper noise. This paper presents Cellular Automata (CA) framework for noise removal of distorted image by the salt an...

متن کامل

Methods for Evaluating, Selecting and Improving Software Clustering Algorithms Mark Shtern a Dissertation Submitted to the Faculty of Graduate Studies in Partial Fulfilment of the Requirements for the Degree of Doctor of Philosophy Graduate Program in Computer Science and Engineering

A common problem that the software industry has to face is the maintenance cost of industrial software systems. One of the main reasons for the high cost of maintenance is the inherent difficulty of understanding software systems that are large, complex, inconsistent (developed using mixed methodologies, have incomplete features) and integrated. One of the approaches that has been developed to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012